On the optimization of bipartite secret sharing schemes
نویسندگان
چکیده
منابع مشابه
On the Optimization of Bipartite Secret Sharing Schemes
Optimizing the ratio between the maximum length of the shares and the length of the secret value in secret sharing schemes for general access structures is an extremely difficult and long-standing open problem. In this paper, we study it for bipartite access structures, in which the set of participants is divided in two parts, and all participants in each part play an equivalent role. We focus ...
متن کاملSecret Sharing Schemes with Bipartite Access Structure
We study the information rate of secret sharing schemes whose access structure is bipartite. In a bipartite access structure there are two classes of participants and all participants in the same class play an equivalent role in the structure. We characterize completely the bipartite access structures that can be realized by an ideal secret sharing scheme. Both upper and lower bounds on the opt...
متن کاملOn Secret Sharing Schemes
The concept of secret sharing has been introduced independently by Shamir and Blakley, as a tool to protect a secret from getting exposed or from being lost. It allows a so-called dealer to share a secret among the members of a set P , which are usually called players or participants, in such a way that only certain specified subsets of players are able to reconstruct the secret while smaller s...
متن کاملCorrection to "Secret Sharing Schemes With Bipartite Access Structure"
We point out some mistakes in Lemma 5.1 and Proposition 5.2 in our paper. Since we are supposing that a ≤ b, the first and the second statements of Lemma 5.1 are not symmetric. The second one must be corrected to: 2. y r = max{0, (t − aN 1)/b} and x r = (t − by r)/a. Besides, the proof of Lemma 5.1 can be more easily understood by beginning it with the proof of the third statement. Due to this ...
متن کاملSecret sharing schemes on graphs
Given a graph G, a perfect secret sharing scheme based on G is a method to distribute a secret data among the vertices of G, the participants, so that a subset of participants can recover the secret if they contain an edge of G, otherwise they can obtain no information regarding the key. The average information rate is the ratio of the size of the secret and the average size of the share a part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2011
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-011-9552-7